Evaluating Idle Time Policies for Real-Time Routing of a Service Vehicle
نویسندگان
چکیده
We empirically evaluate a number of alternative decision rules for real-time routing of a service vehicle. The particular feature of the decision rules is that they aim at more efficient routing of the vehicle by deliberately introducing vehicle idle times. Our goal is to provide both routing information system providers and supply chain operators with criteria for application of these policies in practice. The main characteristic of the class of routing problems considered is that part of the customer requests are uncertain, i.e., that part of the requests are not known in advance, but occur only while the service vehicle already is en route. In order to derive criteria for successful application of the decision rules in practice, we compare the rules by means of computational experiments with respect to a broad variety of instances of the considered class of routing problems. In particular we derive guidelines by varying service region, time horizon and customer request behavior. Eventually, we assess the rules’ performance by comparing them with ideal a posteriori solutions.
منابع مشابه
THE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS
The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...
متن کاملA new Bi-objective model for a Two-echelon Capacitated Vehicle Routing Problem for Perishable Products with the Environmental Factor
In multi-echelon distribution strategy freight is delivered to customers via intermediate depots. Rather than using direct shipments, this strategy is an increasingly popular one in urban logistics. This is primarily to alleviate the environmental (e.g., energy usage and congestion) and social (e.g., traffic-related air pollution, accidents and noise) consequences of logistics operations. This ...
متن کاملAn Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملA hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction
A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...
متن کاملRouting Vehicle of Urban Waste Collection Utilities GIS
Municipal solid waste collection is expensive and, in some cities, 46–85% of their whole waste management expenses are used for waste collection and transportation. Rapid urbanization and every day human actions generate a large amount of waste from residential, commercial, or industrial extents all over the world. Waste collection optimization can decrease the waste collection budget and envir...
متن کامل